skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Babu, Gajendra"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Williamson's theorem states that for any 2n×2n real positive definite matrix A, there exists a 2n×2n real symplectic matrix S such that STAS=D⊕D, where D is an n×n diagonal matrix with positive diagonal entries which are known as the symplectic eigenvalues of A. Let H be any 2n×2n real symmetric matrix such that the perturbed matrix A+H is also positive definite. In this paper, we show that any symplectic matrix S̃ diagonalizing A+H in Williamson's theorem is of the form S̃ =SQ+(‖H‖), where Q is a 2n×2n real symplectic as well as orthogonal matrix. Moreover, Q is in symplectic block diagonal form with the block sizes given by twice the multiplicities of the symplectic eigenvalues of A. Consequently, we show that S̃ and S can be chosen so that ‖S̃ −S‖=(‖H‖). Our results hold even if A has repeated symplectic eigenvalues. This generalizes the stability result of symplectic matrices for non-repeated symplectic eigenvalues given by Idel, Gaona, and Wolf [Linear Algebra Appl., 525:45-58, 2017]. 
    more » « less